#include<iostream>
#include<set>

using namespace std;

set<int>heap;

int main()
{
	int a,k; cin >> a>>k;
	for (int i = 0; i < a; i++)
	{
		int c; cin >> c;
		if(heap.count(c)==0)
		heap.insert(c);
	}
	if (heap.size() < k) cout << "NO RESULT";
	else
	{
		auto i = heap.begin();
		while (--k) i++;
		cout << *i;
	}
	
	return 0;
}
